Algebraic unimodular counting
نویسندگان
چکیده
We study algebraic algorithms for expressing the number of non-negative integer solutions to a unimodular system of linear equations as a function of the right hand side. Our methods include Todd classes of toric varieties via Gröbner bases, and rational generating functions as in Barvinok’s algorithm. We report polyhedral and computational results for two special cases: counting contingency tables and Kostant’s partition function.
منابع مشابه
The space of compatible full conditionals is a unimodular toric variety
The set of all m-tuples of compatible full conditional distributions on discrete random variables is an algebraic set whose defining ideal is a unimodular toric ideal. We identify the defining polynomials of these ideals with closed walks on a bipartite graph. Our algebraic characterization provides a natural generalization of the requirement that compatible conditionals have identical odds rat...
متن کاملFast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral vector of fixed dimension. The complexity (under a unit cost arithmetic model) is strong in the sense that it depends only on the dimensions of A and not on the size of the entries of b. For the special case of “continge...
متن کاملIntegral Bases for Tqft Modules and Unimodular Representations of Mapping Class Groups
We construct integral bases for the SO(3)-TQFT-modules of surfaces in genus one and two at roots of unity of prime order and show that the corresponding mapping class group representations preserve a unimodular Hermitian form over a ring of algebraic integers. For higher genus surfaces the Hermitian form sometimes must be non-unimodular. In one such case, genus 3 and p = 5, we still give an exp...
متن کاملStructure-preserving algorithms for Hermitian solutions of algebraic Riccati equations
In this paper, we propose structure-preserving algorithms for the computation of Hermitian solutions of continuous/discrete-time algebraic Riccati equations. Under assumptions that partial multiplicities of purely imaging and unimodular eigenvalues (if any) of the associated Hamiltonian and symplectic pencil, respectively, are all even, we prove that the developed structure-preserving algorithm...
متن کاملA Structured Doubling Algorithm for Discrete-time Algebraic Riccati Equations with Singular Control Weighting Matrices
In this paper we propose a structured doubling algorithm for solving discrete-time algebraic Riccati equations without the invertibility of control weighting matrices. In addition, we prove that the convergence of the SDA algorithm is linear with ratio less than 1 2 when all unimodular eigenvalues of the closed-loop matrix are semisimple. Numerical examples are shown to illustrate the feasibili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 96 شماره
صفحات -
تاریخ انتشار 2003